package com.shuzijun.leetcode.editor.cn;
public class BestTimeToBuyAndSellStockWithTransactionFee{
    public static void main(String[] args) {
         Solution solution = new BestTimeToBuyAndSellStockWithTransactionFee().new Solution();
    }
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {
        public int maxProfit(int[] prices, int fee) {
            int n = prices.length;
            int[][] dp = new int[n][2];
            dp[0][0] = -prices[0];
            dp[0][1] = 0;
            for (int i = 1; i < n; i++) {
                dp[i][0] = Math.max(dp[i-1][0] , dp[i-1][1] -prices[i]);
                dp[i][1] = Math.max(dp[i-1][0] + prices[i] - fee, dp[i-1][1]);
            }
            return Math.max(dp[n-1][0],dp[n-1][1]);
        }

    }
//leetcode submit region end(Prohibit modification and deletion)

}